graph toughnessの例文

例文

1. Graph toughness was first introduced by.
2. In the branch of mathematics called graph theory, the "'strength "'of an undirected partitions of the set of vertices and detect zones of high concentration of edges, and is analogous to graph toughness which is defined similarly for vertex removal.
3. As well as its use in calculating the arboricity of a graph, matroid partitioning can be used with other matroids to find a subgraph of a given graph whose average degree is maximum, and to find the edge toughness of a graph ( a variant of graph toughness involving the deletion of edges in place of vertices ).
4. V醕lav Chv醫al, in the work in which he invented graph toughness, observed that the square of a " k "-vertex-connected graph is necessarily " k "-tough; he conjectured that 2-tough graphs are Hamiltonian, from which another proof of Fleischner's theorem would have followed.